Change Propagation of View Models by Logic Synthesis using SAT solvers

نویسندگان

  • Oszkár Semeráth
  • Csaba Debreceni
  • Ákos Horváth
  • Dániel Varró
چکیده

View models are key concepts of domain-specific modeling to provide task-specific focus (e.g., power or communication architecture of a system) to the designers by highlighting only the relevant aspects of the system under design. View models can be specified by unidirectional graph queries, and automatically maintained from the underlying source model using incremental transformation techniques. However, tracing back the consequence of a modification in the abstract view to the source model is a challenging task as several valid source changes may correspond to a single change in the view. Calculating these source changes requires complex logic analysis which has to take into account both queries defining the view and the structural well-formedness constraints of the source model. In this paper we outline a systematic technique to calculate valid source candidates by iterative calls to underlying SAT solvers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Synthesis Techniques in SAT Solvers

In many application domains in VLSI CAD, like formal verification or test pattern generation, the problem to be solved can be formulated as an instance of satisfiability (SAT). The SAT instance in this cases is usually derived from a circuit description. In this paper we propose to use techniques known from logic synthesis to speed up SAT solvers. By experiments it is shown that these technique...

متن کامل

Beaver: An SMT Solver for Quantifier-free Bit-vector Logic

This thesis presents Beaver – an efficient SMT solver for the quantifier-free fixed-size bit-vector logic (QF BV). Beaver is an eager solver, that is, given an SMT formula, it first performs word-level simplications and then bitblasts the simplified formula to a Boolean formula, which is then solved using any SAT solver. Several engineering techniques are behind its efficiency: 1) efficient con...

متن کامل

Propagation = Lazy Clause Generation

Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we describe how we can mimic a finite domain propagation engine, by mapping propagators into clauses in a SAT solver. This immediately results in strong nogoods for finite domain propagation. But a naive static translati...

متن کامل

Smten and the art of satisfiability-based search

Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) have been leveraged in solving a wide variety of important and challenging combinatorial search problems, including automatic test generation, logic synthesis, model checking, program synthesis, and software verification. Though in principle SAT and SMT solvers simplify the task of developing practical solutions to these hard combina...

متن کامل

Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers

Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such constraints in termination tools is treating them as polynomial constraints. Several recent works develop connections between these problems and more standard constraint solving problems for which well-known and efficient...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016